Distributional Learning of Simple Context-Free Tree Grammars
Identifieur interne : 000924 ( Main/Exploration ); précédent : 000923; suivant : 000925Distributional Learning of Simple Context-Free Tree Grammars
Auteurs : Anna Kasprzik [Allemagne] ; Ryo Yoshinaka [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.
Url:
DOI: 10.1007/978-3-642-24412-4_31
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001796
- to stream Istex, to step Curation: 001680
- to stream Istex, to step Checkpoint: 000137
- to stream Main, to step Merge: 000955
- to stream Main, to step Curation: 000924
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></author><author><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B0186252445537B2343714CEAE46FF0F4725DEB8</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-24412-4_31</idno><idno type="url">https://api.istex.fr/document/B0186252445537B2343714CEAE46FF0F4725DEB8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001796</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001796</idno><idno type="wicri:Area/Istex/Curation">001680</idno><idno type="wicri:Area/Istex/Checkpoint">000137</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000137</idno><idno type="wicri:doubleKey">0302-9743:2011:Kasprzik A:distributional:learning:of</idno><idno type="wicri:Area/Main/Merge">000955</idno><idno type="wicri:Area/Main/Curation">000924</idno><idno type="wicri:Area/Main/Exploration">000924</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Distributional Learning of Simple Context-Free Tree Grammars</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>ERATO MINATO Project, Japan Science and Technology Agency</wicri:regionArea><wicri:noRegion>Japan Science and Technology Agency</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">B0186252445537B2343714CEAE46FF0F4725DEB8</idno><idno type="DOI">10.1007/978-3-642-24412-4_31</idno><idno type="ChapterID">31</idno><idno type="ChapterID">Chap31</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Japon</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></noRegion></country><country name="Japon"><noRegion><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name></noRegion><name sortKey="Yoshinaka, Ryo" sort="Yoshinaka, Ryo" uniqKey="Yoshinaka R" first="Ryo" last="Yoshinaka">Ryo Yoshinaka</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000924 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000924 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B0186252445537B2343714CEAE46FF0F4725DEB8
|texte= Distributional Learning of Simple Context-Free Tree Grammars
}}
| This area was generated with Dilib version V0.6.31. |  |